Fast practical multi-pattern matching
نویسندگان
چکیده
منابع مشابه
Fast Practical Multi-Pattern Matching
The multi-pattern matching problem consists in finding all occurrences of the patterns from a finite set X in a given text T of length n. We present a new and simple algorithm combining the ideas of the Aho–Corasick algorithm and the directed acyclic word graphs. The algorithm has time complexity which is linear in the worst case (it makes at most 2n symbol comparisons) and has good average-cas...
متن کاملFast Multi-dimensional Approximate Pattern Matching
We address the problem of approximate string matching in d dimensions, that is, to nd a pattern of size m d in a text of size n d with at most k < m d errors (substitutions, insertions and deletions along any dimension). We use a novel and very exible error model, for which there exists only an algorithm to evaluate the similarity between two elements in two dimensions at O(m 4) time. We extend...
متن کاملSigMatch: Fast and Scalable Multi-Pattern Matching
Multi-pattern matching involves matching a data item against a large database of “signature” patterns. Existing algorithms for multipattern matching do not scale well as the size of the signature database increases. In this paper, we present sigMatch – a fast, versatile, and scalable technique for multi-pattern signature matching. At its heart, sigMatch organizes the signature database into a (...
متن کاملFast Practical Exact and Approximate Pattern Matching in Protein Sequences
Here we design, analyse and implement an algorithm that searches for motifs in protein sequences using masking techniques (“wordlevel” parrallelism). Our algorithm speeds up known algorithms by a factor of 20 (or the alphabet size). Furthermore, we present graphs of the running times of the algorithm in comparison to its theoritical time complexity.
متن کاملPractical Pattern Matching
No new genes? At the University of Toronto, Brendan Frey is leading a group of scientists who are using AI techniques to analyze molecularbiology data. One of their projects involves using a factor graph they developed called GenRate to discover and evaluate genes in mouse tissues. Factor graphs let researchers describe a system with complex variables, such as gene location in DNA as well as ge...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information Processing Letters
سال: 1999
ISSN: 0020-0190
DOI: 10.1016/s0020-0190(99)00092-7